Dehn functions of finitely presented metabelian groups
نویسندگان
چکیده
In this paper, we compute an upper bound for the Dehn function of a finitely presented metabelian group. addition, prove that same works relative generated We also show every wreath product free abelian group finite rank with can be embedded into exponential function.
منابع مشابه
Subgroups of Finitely Presented Centre-by-metabelian Groups
1.1. Baumslag's theorem has another facet. It shows that in the variety 2l of metabelian groups, every finitely generated $I-group G occurs as a subgroup of some finitely presented 2I-group G. The analogous result for the variety of all groups is a celebrated theorem of G. Higman [8] which states that a finitely generated group G is the subgroup of a finitely presented group G if, and only if, ...
متن کاملOn Dehn Functions of Finitely Presented Bi-Automatic Monoids
For each automatic monoid the word problem can be solved in quadratic time (Campbell et al 1996), and hence, the Dehn function of a nitely presented automatic monoid is recursive. Here we show that this result on the Dehn function cannot be improved in general by presenting nitely presented bi-automatic monoids the Dehn functions of which realize arbitrary complexity classes that are suuciently...
متن کاملFinitely Presented Subgroups of Automatic Groups and Their Isoperimetric Functions
We describe a general technique for embedding certain amalgamated products into direct products. This technique provides us with a way of constructing a host of finitely presented subgroups of automatic groups which are not even asynchronously automatic. We can also arrange that such subgroups satisfy, at best, an exponential isoperimetric inequality.
متن کاملFinitely Presented Residually Free Groups
We establish a general criterion for the finite presentability of subdirect products of groups and use this to characterize finitely presented residually free groups. We prove that, for all n ∈ N, a residually free group is of type FPn if and only if it is of type Fn. New families of subdirect products of free groups are constructed, including the first examples of finitely presented subgroups ...
متن کاملThe Algorithmic Theory of Finitely Generated Metabelian Groups
Algorithms are constructed which, when an explicit presentation of a finitely generated metabelian group G in the variety si1 is given, produce unitary presentations for the derived subgroup G', the centre Z{G), the Fitting subgroup Fit(G), and the Frattini subgroup <p(G). Additional algorithms of independent interest are developed for commutative algebra which construct the associated set of p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Group Theory
سال: 2021
ISSN: ['1435-4446', '1433-5883']
DOI: https://doi.org/10.1515/jgth-2020-0182